Asynchronous analysis of parallel dynamic programming algorithms
نویسندگان
چکیده
منابع مشابه
Asynchronous Analysis of Parallel Dynamic Programming Algorithms
We examine a very simple asynchronous model of parallel computation that assumes the time to compute a task is random, following some probability distribution. The goal of this model is to capture the eeects of unpredictable delays on processors, due to communication delays or cache misses, for example. Using techniques from queueing theory and occupancy problems, we use this model to analyze t...
متن کاملParallel Dynamic Programming Algorithms: Multitransputer Systems
The present paper discusses real parallel computations. On the basis of a selected group of dynamic programming algorithms, a number of factors affecting the efficiency of parallel computations such as, e.g., the way of distributing tasks, the interconnection structure between particular elements of the parallel system or the way of organizing of interprocessor communication are analyzed. Compu...
متن کاملAsynchronous Parallel Programming in Pei
This paper presents a transformational approach for the derivation of asynchronous parallel programs. Transformation rules are based on a theory, called Pei. This theory includes the deenitions of problems , programs and transformation rules. It is founded on the simple mathematical concepts of multiset and of an equivalence between their representations as data elds. Program transformations ar...
متن کاملOn Parallel Evaluation of Matrix-Based Dynamic Programming Algorithms
Dynamic programming techniques are well established and employed by various practical algorithms, for instance the edit-distance algorithm. These algorithms usually operate in iteration-based fashion where new values are computed from values of the previous iterations, thus they cannot be processed by simple data-parallel approaches. In this paper, we investigate possibilities of employing mult...
متن کاملParallel Asynchronous Team Algorithms: Convergence and Performance Analysis
This paper formalizes a general technique to combine different methods in the solution of large systems of nonlinear equations using parallel asynchronous implementations on distributed-memory multiprocessor systems. Such combinations of methods, referred to as Team Algorithms, are evaluated as a way of obtaining desirable properties of different methods and a sufficient condition for their con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Parallel and Distributed Systems
سال: 1996
ISSN: 1045-9219
DOI: 10.1109/71.494636